The Hypermetric Cone on Seven Vertices
نویسندگان
چکیده
The hypermetric cone HY Pn is the set of vectors (dij)1≤i<j≤n satisfying the inequalities
منابع مشابه
The Hypermetric Cone on 8 Vertices and Some Generalizations
The lists of facets – 298, 592 in 86 orbits – and of extreme rays – 242, 695, 427 in 9, 003 orbits – of the hypermetric cone HY P8 are computed. The first generalization considered is the hypermetric polytope HY PPn for which we give general algorithms and a description for n ≤ 8. Then we shortly consider generalizations to simplices of volume higher than 1, hypermetric on graphs and infinite d...
متن کاملThe six-dimensional Delaunay polytopes
Given a lattice L, a full dimensional polytope P is called a Delaunay polytope if the set of its vertices is S ∩ L with S being an empty sphere of the lattice. Extending our previous work [DD01] on the hypermetric cone HY P7, we classify the six-dimensional Delaunay polytopes according to their combinatorial type. The list of 6241 combinatorial types is obtained by a study of the set of faces o...
متن کاملThe hypermetric cone is polydedral
The hypermetric cone Hn is the cone in the space R n(n1)/2 of all vectors d = (dij) 1 <i< j <_ n satisfying the hypermetric inequalities: El<_i<j<n zjzjdij ~0 for all integer vectors z in Z n with E l < i < n zi = 1. We explore connections of the hypermetric cone with quadratic forms and the geometry of numbers (empty spheres and L-polytopes in lattices). As an application, we show that the hyp...
متن کاملFacets for the cut cone I
We study facets of the cut cone C,, i.e., the cone of dimension 1⁄2n(n 1) generated by the cuts of the complete graph on n vertices. Actually, the study of the facets of the cut cone is equivalent in some sense to the study of the facets of the cut polytope. We present several operations on facets and, in particular, a "'lifting" procedure for constructing facets of C~ +1 from given facets of t...
متن کاملFacets for the cut cone II: Clique-web inequalities
We study new classes of facets for the cut cone C, generated by the cuts of the complete graph on n vertices. This cone can also be interpreted as the cone of all semi-metrics on n points that are isometrically l~-embeddable and, in fact, the study of the facets of the cut polytope is in some sense equivalent to the study of the facets of C~. These new facets belong to the class of clique-web i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Experimental Mathematics
دوره 12 شماره
صفحات -
تاریخ انتشار 2003